Model collisions in the dissimilarity SOM

نویسنده

  • Fabrice Rossi
چکیده

We investigate in this paper the problem of model collisions in the Dissimilarity Self Organizing Map (SOM). This extension of the SOM to dissimilarity data suffers from constraints imposed on the model representation, that lead to some strong map folding: several units share a common prototype. We propose in this paper an efficient way to address this problem via a branch and bound approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Self-Organizing Map for Dissimilarity Data

The Self-Organizing Map (Kohonen, 1997) is an effective and a very popular tool for data clustering and visualization. With this method, the input samples are projected into a low dimension space while preserving their topology. The samples are described by a set of features. The input space is generally a high dimensional space Rd. 2D or 3D maps are very often used for visualization in a low d...

متن کامل

Fast algorithm and implementation of dissimilarity self-organizing maps

In many real-world applications, data cannot be accurately represented by vectors. In those situations, one possible solution is to rely on dissimilarity measures that enable a sensible comparison between observations. Kohonen's self-organizing map (SOM) has been adapted to data described only through their dissimilarity matrix. This algorithm provides both nonlinear projection and clustering o...

متن کامل

How Many Dissimilarity/Kernel Self Organizing Map Variants Do We Need?

In numerous applicative contexts, data are too rich and too complex to be represented by numerical vectors. A general approach to extend machine learning and data mining techniques to such data is to really on a dissimilarity or on a kernel that measures how different or similar two objects are. This approach has been used to define several variants of the Self Organizing Map (SOM). This paper ...

متن کامل

Speeding Up the Dissimilarity Self-Organizing Maps by Branch and Bound

This paper proposes to apply the branch and bound principle from combinatorial optimization to the Dissimilarity Self-Organizing Map (DSOM), a variant of the SOM that can handle dissimilarity data. A new reference model optimization method is derived from this principle. Its results are strictly identical to those of the original DSOM algorithm by Kohonen and Somervuo, while its running time is...

متن کامل

The pattern determination of sea surface temperature distribution and chlorophyll a in the Southern Caspian Sea using SOM Model

Remote sensing has changed modern oceanography by proving synoptic periodic data which can be processed. Since the satellite data are usually too much and nonlinear, in most cases, it is difficult to distinguish the patterns from these images. In fact, SOM (Self-Organizing Maps) model is a type of ANN (Artificial Neural Network) that has the ability to distinguish the efficient patterns from th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007